package com.atguigu.sortandsearch;

import java.util.Arrays;

/**
 * @author ：MJS
 * @date ：Created in 2021/5/27  23:38
 * @description：TODO
 */
public class test {
    public static void main(String[] args) {
        int [] data={3,44,58,5,47,15,36,26,27,2,46,4,19,50,48};
        System.out.println("排序之前："+ Arrays.toString(data));
    }
    public static void quickSort(int[]data,int low,int high){
        int i,j,temp,t;
        if(low>high){
            return;
        }
        i=low;
        j=high;
        //temp就是基准位
        temp=data[low];
        System.out.println("基准位："+temp);
        while(i<j){
            //先看右边
         /*   while(temp<=data[j] && ){

            }*/

        }
    }
}
